A Simulation-based XML Routing Synopsis in Unstructured P2P Networks
نویسندگان
چکیده
Many emerging applications that use XML are distributed, usually over large peer-to-peer (P2P) networks on the Internet. The deployment of an XML query shipping system over P2P networks requires a specialized synopsis to capture XML data in routing tables. In this paper, we propose a novel graph-structured routing synopsis, called kd-synopsis, for deployment over unstructured super-peer based P2P networks. This synopsis is based on length-constrained FBsimulation relationship, which allows the balancing of the precision and size of the synopsis according to different space constraints on peers with heterogeneous capacity. We report comprehensive experiments to demonstrate the effectiveness of the kd-synopsis.
منابع مشابه
A Topology Adaptation Protocol for Structured Superpeer Overlay Construction
Peer-to-peer networks can be divided into structured and unstructured based on their overlay topologies. In reality, unstructured p2p networks with superpeers have proved their capacities to support millions of users simultaneously. However, applications deployed on this kind of overlay networks, such as file-sharing, require flooding or gossip-based message routing, which puts more overhead on...
متن کاملTopologies in Unstructured Peer To Peer Networks
The Peer-to-Peer (P2P) architectures that are most prevalent in today's Internet are decentralized and unstructured. As the peers participating in unstructured networks interconnect randomly, they rely on flooding query messages to discover objects of interest and thus introduce remarkable network traffic. Empirical measurement studies indicate that the peers in P2P networks have similar prefer...
متن کاملXML Query Routing in Structured P2P Systems
This paper addresses the problem of data placement, indexing, and querying large XML data repositories distributed over an existing P2P service infrastructure. Our architecture scales gracefully to the network and data sizes, is fully distributed, fault tolerant and selforganizing, and handles complex queries efficiently, even those queries that use full-text search. Our framework for indexing ...
متن کاملOntology - Based Routing for Large - Scale Unstructured P 2 P Publish / Subscribe System
--------------------------------------------------------ABSTRACT----------------------------------------------------------Recent works in structured P2P systems exploit DHT to support publish/subscribe(Pub/Sub) protocols. Some of these approaches require the existence of a so-called rendezvous node where subscriptions meet events, thus easily creating bottlenecks. By contrast, unstructured P2P ...
متن کاملEnhanced Search in Unstructured Peer-to-Peer Overlay Networks
Unstructured Peer-to-Peer (P2P) overlays are the most widely used topologies in P2P systems because of their simplicity and very limited control overhead. A P2P overlay specifies the logical connections among peers in a network. Such logical links define the order in which peers are queried in search for a specific resource. The most popular query routing algorithms are based on flooding, thus ...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
عنوان ژورنال:
دوره شماره
صفحات -
تاریخ انتشار 2005